Cryptanalysis of a Knapsack Based Two-Lock Cryptosystem
نویسندگان
چکیده
In this paper we break a knapsack based two-lock cryptosystem proposed at ICICS’03 [7]. The two-lock cryptosystem is a commutative encryption algorithm that is very useful for the construction of the general t-out-of-n oblivious transfers and millionaire protocol. However, our analysis shows that the proposed knapsack based two-lock cryptosystem is extremely insecure. The serious flaw is that the sender in the two-lock cryptosystem can retrieve the secret key of the receiver fairly easily. We have implemented the attack on a Pentium 4 2.5 GHz processor. For the parameters given in [7], it takes only several minutes to break that knapsack based two-lock cryptosystem.
منابع مشابه
Cryptanalysis of a New Knapsack Type Public-Key Cryptosystem
— Recently, Hwang et al. introduced a knapsack type public-key cryptosystem. They proposed a new algorithm called permutation combination algorithm. By exploiting this algorithm, they attempt to increase the density of knapsack to avoid the low-density attack. We show that this cryptosystem is not secure, as it based on basic Merkel-Hellman knapsack cryptosystem and because of the superincreasi...
متن کاملCryptanalysis of two knapsack public-key cryptosystems
In this paper, we cryptanalyze two knapsack cryptosystems. The first one is proposed by Hwang et al [4], which is based on a new permutation algorithm named Permutation Combination Algorithm. We show that this permutation algorithm is useless to the security of the cryptosystem. Because of the special super increasing structure, we can break this cryptosystem use the method provided by Shamir a...
متن کاملMerkle-Hellman Revisited: A Cryptanalysis of the Qu-Vanstone Cryptosystem Based on Group Factorizations
Cryptosystems based on the knapsack problem were among the rst public key systems to be invented and for a while were considered quite promising. Basically all knapsack cryptosystems that have been proposed so far have been broken, mainly by means of lattice reduction techniques. However, a few knapsack-like cryptosystems have withstood cryptanalysis, among which the Chor-Rivest scheme 2] even ...
متن کاملCryptanalysis of a Public-key Cryptosystem Using Lattice Basis Reduction Algorithm
In this paper, we proposed a new attack against Hwang et al.’s cryptosystem. This cryptosystem uses a super-increasing sequence as private key and the authors investigate a new algorithm called permutation combination algorithm to enhance density of knapsack to avoid the low-density attack. Sattar J. Aboud [Aboud j. Sattar, “An improved knapsack public key cryptography system”, International Jo...
متن کاملComplexity Evaluation of Knapsack Crypto System using Fuzzy Set
It is well known that the knapsack cryptosystem is a type of public key cryptosystems. It is based on the well known mathematical concept, i.e., the choosing of one way function. Many Knapsack cryptosystems were invented in the last 20 years, and many attacking methods were invented as a counterattack against the developed knapsack cryptosystems. All the attacking methods aim towards breaking t...
متن کامل